Overlapping Coordination Methodology by Mixed Decomposition Method
نویسندگان
چکیده
منابع مشابه
Hierarchical Overlapping Coordination for Large-Scale Optimization by Decomposition
Decomposition of large engineering design problems into smaller design subproblems enhances robustness and speed of numerical solution algorithms. Design subproblems can be solved in parallel, using the optimization technique most suitable for the underlying subproblem. This also reflects the typical multidisciplinary nature of system design problems and allows better interpretation of results....
متن کاملNon-overlapping Domain Decomposition Method and Nodal Finite Element Method
The non-overlapping domain decomposition method is an efficient approach for solving time harmonic scattering wave problems. It is used here to reduce large size systems solution to that of several systems of small size and to construct efficient procedures to couple finite element and boundary element methods. The lack of a satisfactory treatment of the so-called cross-points, nodes being shar...
متن کاملA Parallel Overlapping Time-Domain Decomposition Method for ODEs
We introduce an overlapping time-domain decomposition for linear initial-value 7 problems which gives rise to an efficient solution method for parallel computers without 8 resorting to the frequency domain. This parallel method exploits the fact that homogeneous 9 initial-value problems can be integrated much faster than inhomogeneous problems by using 10 an efficient Arnoldi approximation for ...
متن کاملAn Overlapping Domain Decomposition Method for Parameter Identification Problems∗
A parallel fully coupled one-level Newton-Krylov-Schwarz method is investigated for solving the nonlinear system of algebraic equations arising from the finite difference discretization of inverse elliptic problems. Both L and H least squares formulations are considered with the H regularization. We show numerically that the preconditioned iterative method is optimally scalable with respect to ...
متن کاملA convergent overlapping domain decomposition method for total variation minimization
In this paper we are concerned with the analysis of convergent sequential and parallel overlapping domain decomposition methods for the minimization of functionals formed by a discrepancy term with respect to the data and a total variation constraint. To our knowledge, this is the first successful attempt of addressing such a strategy for the nonlinear, nonadditive, and nonsmooth problem of tot...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Society of Instrument and Control Engineers
سال: 1989
ISSN: 0453-4654
DOI: 10.9746/sicetr1965.25.1225